Reification - Changing Viewpoint but Preserving Truth
نویسنده
چکیده
The aim of our work is the modelling and design of information systems in the object-oriented setting. An object-oriented spec-iication covers structural as well as behavioural aspects of the system. A possibility to describe system dynamics is to use a temporal logic as it is done in the formal object-oriented speciication language Troll. Temporal logics is particularly suited to deal with temporal behaviour and evolutionary aspects of systems. Reiication techniques have been developed to break down the software design process in pieces with reduced complexity. We support action reii-cation, i.e., actions are reiied by complex processes or so-called transactions. Thus, reiication corresponds to a change of viewpoint: what has been atomic from the abstract point of view may become compound from the reiied point of view. Problems arise when reiication is considered in conjunction with temporal logic. Temporal formulae which incorporate action symbols have to be treated carefully under the presence of reii-cation. In this paper we propose the so-called reiication logic by extending a linear temporal logic by the concept of transaction. A transaction is a logical unit of a speciic abstraction level which is composed of several actions of a more concrete level. We propose an appropriate translation of Troll concepts in reiication logic which is compatible with reiica-tion. This way, we establish a framework which has the capability to deal with reiication in object-oriented speciication.
منابع مشابه
T-norm based fuzzy logics preserving degrees of truth
T-norm based fuzzy logics are usually considered as truth preserving, that is, taking 1 as the only truth value to be preserved in inferences. In this paper we study t-norm based fuzzy logics preserving degrees of truth, that is, preserving the lower bounds of the truth degrees of the premises. These logics are axiomatizable by using a restricted form of Modus Ponens together with the rule of A...
متن کاملA Reference Model for Requirements Engineering
The Reference Model of Gunter et al., 2000, provides a framework for describing and analyzing key software engineering artifacts and their properties. In this paper we propose a reification of this framework in which behaviour is explicitly trace-based. We find that this benefits the formalism in adding structure in ways which are meaningful and practical from an engineering viewpoint. In parti...
متن کاملA Fuzzy RDF Semantics to Represent Trust Metadata
The need for fuzzy knowledge bases arises from many application fields, such as trust management. To represent fuzzy data, a syntactic and semantic extension of RDF is proposed. The syntax adds to each triple a truth value. The semantic for Fuzzy RDF and Fuzzy RDF Schema allows to derive truth values for derived statements as well. Fuzzy RDF/RDFS does not aim to become a standard extension to p...
متن کاملApproximate Counting for Complex-Weighted Boolean Constraint Satisfaction Problems
Constraint satisfaction problems (or CSPs) have been extensively studied in, for instance, artificial intelligence, database theory, graph theory, and statistical physics. From a practical viewpoint, it is beneficial to approximately solve CSPs. When one tries to approximate the total number of truth assignments that satisfy all Boolean constraints for (unweighted) Boolean CSPs, there is a know...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995